<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
	This ontology document is licensed under the Creative Commons
	Attribution License. To view a copy of this license, visit
	http://creativecommons.org/licenses/by/2.0/ or send a letter to
	Creative Commons, 559 Nathan Abbott Way, Stanford, California
	94305, USA.
-->
 <channel rdf:about="http://ebiquity.umbc.edu//tag/html/programming languages/?t=programming+languages">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <title><![CDATA[UMBC ebiquity RSS Tag Search]]></title>
  <link><![CDATA[http://ebiquity.umbc.edu//tag/html/programming languages/?t=programming+languages]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for programming languages]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/273/Constraint-Generation-and-Reasoning-in-OWL"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/890/Leveraging-Artificial-Intelligence-to-Advance-Problem-Solving-with-Quantum-Annealers"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/427/Constraint-Generation-and-Reasoning-in-OWL"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/570/Using-Automatic-Memoization-as-a-Software-Engineering-Tool-in-Real-World-AI-Systems"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/682/Adding-forward-chaining-and-truth-maintenance-to-Prolog"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/273/Constraint-Generation-and-Reasoning-in-OWL">
  <title><![CDATA[Constraint Generation and Reasoning in OWL]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/273/Constraint-Generation-and-Reasoning-in-OWL</link>
  <description><![CDATA[The majority of OWL ontologies in the emerging Semantic Web are constructed from properties that lack domain and range constraints. Constraints in OWL are different from the familiar uses in programming languages and databases, and are actually type assertions that are made about the individuals which are connected by the property. These assertions can add vital information to the model because they are assertions of type on the individuals involved, and they can also give information on how ...]]></description>
  <dc:date>2008-11-17</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/890/Leveraging-Artificial-Intelligence-to-Advance-Problem-Solving-with-Quantum-Annealers">
  <title><![CDATA[Leveraging Artificial Intelligence to Advance Problem-Solving with Quantum Annealers]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/890/Leveraging-Artificial-Intelligence-to-Advance-Problem-Solving-with-Quantum-Annealers</link>
  <description><![CDATA[We show how to advance quantum information processing, specifically problem-solving with quantum annealers, in the realm of artificial intelligence.  We introduce SAT++, as a novel quantum programming paradigm, that can compile classical algorithms (implemented in classical programming languages) and execute them on quantum annealers.   Moreover, we introduce a post-quantum error correction method that can find samples with significantly lower energy values, compared to the state-of-the-art t...]]></description>
  <dc:date>2020-05-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/427/Constraint-Generation-and-Reasoning-in-OWL">
  <title><![CDATA[Constraint Generation and Reasoning in OWL]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/427/Constraint-Generation-and-Reasoning-in-OWL</link>
  <description><![CDATA[The majority of OWL ontologies in the emerging SemanticWeb are constructed from properties that lack domain and range constraints. Constraints in OWL are different from the familiar uses in programming languages and databases. They are actually type assertions that are made about the individualswhich are connected by the property. Because they are type assertions these assertions can add vital information to the individuals involved and give information on how the defining property may be use...]]></description>
  <dc:date>2008-11-17</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/570/Using-Automatic-Memoization-as-a-Software-Engineering-Tool-in-Real-World-AI-Systems">
  <title><![CDATA[Using Automatic Memoization as a Software Engineering Tool in Real-World AI Systems]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/570/Using-Automatic-Memoization-as-a-Software-Engineering-Tool-in-Real-World-AI-Systems</link>
  <description><![CDATA[Memo functions and memoization are well-known concepts in AI programming. They have been discussed since the sixties and are often used as examples in introductory programming texts. However, the automation of memoization as a practical software engineering tool for AI systems has not received a detailed treatment. This paper describes how automatic memoization can be made viable on a large scale. It points out advantages and uses of automatic memoization not previously described, identifies ...]]></description>
  <dc:date>1995-02-20</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/682/Adding-forward-chaining-and-truth-maintenance-to-Prolog">
  <title><![CDATA[Adding forward chaining and truth maintenance to Prolog]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/682/Adding-forward-chaining-and-truth-maintenance-to-Prolog</link>
  <description><![CDATA[This paper describes Pfc, a simple package that supplies a forward chaining facility in Prolog. Pfc is intended to be used in conjunction with ordinary Prolog programs, allowing the programmer to decide whether to encode a rule as a forward-chaining Pfc rule or a backward-chaining Prolog one. Like other logic programming languages, Pfc programs have a declarative interpretation as well as a clear and predictable procedural one. A truth maintenance system is built into the Pfc system, which ma...]]></description>
  <dc:date>1989-03-06</dc:date>
 </item>
</rdf:RDF>
